Computation of the q-th roots of circulant matrices

Roots and Canonical Forms for Circulant Matrices

Computing the Square Roots of a Class of Circulant Matrices

Computation of Maximal Determinants of Binary Circulant Matrices

We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here “binary matrix” means a matrix whose elements are drawn from {0, 1} or {−1, 1}. We describe efficient parallel algorithms for the search, using Duval’s algorithm for generation of Lyndon words and the well-known representation of the determinant of a circulant in terms of roots of unity....

Application of Circulant Matrices

A k x k matrix A = [aU lover a field F is called circulant if aij = a (j-i) mod k' A [2k ,k l linear code over F = GF (q) is called double-circulant if it is generated by a matrix of the fonn [I A l, where A is a circulant matrix. In this work we ftrst employ the Fourier transform techJ nique to analyze and construct se:veral families of double-circulant codes. The minimum distance of the resul...

unit group of algebra of circulant matrices

let $cr_n(f_p)$ denote the algebra of $n times n$ circulant‎ ‎matrices over $f_p$‎, ‎the finite field of order $p$ a prime‎. ‎the‎ ‎order of the unit groups $mathcal{u}(cr_3(f_p))$‎, ‎$mathcal{u}(cr_4(f_p))$ and $mathcal{u}(cr_5(f_p))$ of algebras of‎ ‎circulant matrices over $f_p$ are computed‎.

analysis of reading comprehension needs of the students of paramedical studies: the case of the students of health information management (him)

چکیده ندارد.